Equivalence Classes of Full-Dimensional $$0/1$$ 0 / 1 -Polytopes with Many Vertices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-Dimensional Faces of Random 0/1-Polytopes

holds for the expected value of φk(P ). The threshold for k = 1 has recently been determined in [1]. In particular, these results indicate that the high face densities often encountered in polyhedral combinatorics (e.g., for the cut-polytopes of complete graphs) should be considered more as a phenomenon of the general geometry of 0/1-polytopes than as a feature of the special combinatorics of t...

متن کامل

Simple 0/1-Polytopes

For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very di erent within the class of 0/1-polytopes, since every simple 0/1-polytope is the (cartesian) product of some 0/1-simplices (which proves a ...

متن کامل

Normal 0-1 Polytopes

We study the question of when 0-1 polytopes are normal or, equivalently, having the integer decomposition property. In particular, we shall associate to each 0-1 polytope a labeled hypergraph, and examine the equality between its Ehrhart and polytopal rings via the combinatorial structures of the labeled hypergraph.

متن کامل

0/1 Polytopes with Quadratic Chvátal Rank

For a polytope P , the Chvátal closure P ′ ⊆ P is obtained by simultaneously strengthening all feasible inequalities cx ≤ β (with integral c) to cx ≤ ⌊β⌋. The number of iterations of this procedure that are needed until the integral hull of P is reached is called the Chvátal rank. If P ⊆ [0, 1], then it is known that O(n log n) iterations always suffice (Eisenbrand and Schulz (1999)) and at lea...

متن کامل

A Bound for the Splitting of Smooth Fano Polytopes with Many Vertices

The classification of toric Fano manifolds with large Picard number corresponds to the classification of smooth Fano polytopes with large number of vertices. A smooth Fano polytope is a polytope that contains the origin in its interior such that the vertex set of each facet forms a lattice basis. Casagrande showed that any smooth d-dimensional Fano polytope has at most 3d vertices. Smooth Fano ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2014

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-014-9630-5